Provable Security of 3GPP Integrity Algorithm f9
نویسندگان
چکیده
منابع مشابه
Provable Security of KASUMI and 3GPP Encryption Mode f8
Within the security architecture of the 3GPP system there is a standardised encryption mode f8 based on the block cipher KASUMI. In this work we examine the pseudorandomness of the block cipher KASUMI and the provable security of f8. First we show that the three round KASUMI is not a pseudorandom permutation ensemble but the four round KASUMI is a pseudorandom permutation ensemble under the ada...
متن کاملNew Security Proofs for the 3GPP Confidentiality and Integrity Algorithms
This paper analyses the 3GPP confidentiality and integrity schemes adopted by UniversalMobile Telecommunication System, an emerging standard for third generation wireless commu-nications. The schemes, known as f8 and f9, are based on the block cipher KASUMI. Althoughprevious works claim security proofs for f8 and f9′, where f9′ is a generalized versions of f9,it was recently sho...
متن کاملA Concrete Security Analysis for 3GPP-MAC
The standardized integrity algorithm f9 of the 3GPP algorithm computes a MAC (Message Authentication Code) to establish the integrity and the data origin of the signalling data over a radio access link of W-CDMA IMT-2000. The function f9 is based on the block cipher KASUMI and it can be considered as a variant of CBC-MAC. In this paper we examine the provable security of f9. We prove that f9 is...
متن کاملA New Variant of 3GPP-MAC With Provable Security and Higher Efficiency
3GPP-MAC, also called f 9, is an integrity scheme adopted by Universal Mobile Telecommunication System as a standard for the 3rd generation wireless communications. In this paper, we investigate the feasibility of improving its efficiency, with the precondition that its security would not be compromised. As we show, the newly proposed f 9 enjoys provable security under the solo PRP assumption; ...
متن کاملProvable Security of Networks
We propose a security hypothesis that a network is secure, if any deliberate attacks of a small number of nodes will never generate a global failure of the network, and a robustness hypothesis that a network is robust, if a small number of random errors will never generate a global failure of the network. Based on these hypotheses, we propose a definition of security and a definition of robustn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartC
سال: 2002
ISSN: 1598-2858
DOI: 10.3745/kipstc.2002.9c.4.573